Eecient Constructions of ?biased Arrays, ?dependent Arrays and Authentication Codes
نویسنده
چکیده
منابع مشابه
Almost Independent and Weakly Biased Arrays: Eecient Constructions and Cryptologic Applications
The best known constructions for arrays with low bias are those from 1] and the exponential sum method based on the Weil-Carlitz-Uchiyama bound. They all yield essentially the same parameters. We present new eecient coding-theoretic constructions, which allow far-reaching generalizations and improvements. The classical constructions can be described as making use of Reed-Solomon codes. Our recu...
متن کاملAlmost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same parameters. We present new efficient coding-theoretic constructions, which allow farreaching generalizations and improvements. The classical constructions can be described as making use of Reed-Solomon codes. Our rec...
متن کاملNew Constructions for Perfect Hash Families andRelated Structures using Combinatorial
In this paper, we consider explicit constructions of perfect hash families using combi-natorial methods. We provide several direct constructions from combinatorial structures related to orthogonal arrays. We also simplify and generalize a recursive construction due to Atici, Magliversas, Stinson and Wei 3]. Using similar methods, we also obtain eecient constructions for separating hash families...
متن کاملCovering arrays from cyclotomy
For a prime power q ≡ 1 (mod v), the q × q cyclotomic matrix, whose entries are the discrete logarithmsmodulo v of the entries in the addition table of Fq , has been shown using character theoretic arguments to produce an ε-biased array, provided that q is large enough as a function of v and ε. A suitable choice of ε ensures that the array is a covering array of strength t when q > t2v4t . On t...
متن کاملConstructions for retransmission permutation arrays
Li, Liu, Tan, Viswanathan, and Yang [3] introduced a technique for resolving overlapping channel transmissions that used an interesting new type of combinatorial structure. In connection with this problem, they provided an example of a 4× 4 array having certain desirable properties. We define a class of combinatorial structures, which we term retransmission permutation arrays, that generalise t...
متن کامل